Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations
نویسندگان
چکیده
منابع مشابه
Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations.
The linear preferential attachment hypothesis has been shown to be quite successful in explaining the existence of networks with power-law degree distributions. It is then quite important to determine if this mechanism is the consequence of a general principle based on local rules. In this work it is claimed that an effective linear preferential attachment is the natural outcome of growing netw...
متن کاملClustering and preferential attachment in growing networks.
We study empirically the time evolution of scientific collaboration networks in physics and biology. In these networks, two scientists are considered connected if they have coauthored one or more papers together. We show that the probability of a pair of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scient...
متن کاملTranscriptional Network Growing Models Using Motif-Based Preferential Attachment
Understanding relationships between architectural properties of gene-regulatory networks (GRNs) has been one of the major goals in systems biology and bioinformatics, as it can provide insights into, e.g., disease dynamics and drug development. Such GRNs are characterized by their scale-free degree distributions and existence of network motifs - i.e., small-node subgraphs that occur more abunda...
متن کاملPreferential attachment in growing spatial networks
We obtain the degree distribution for a class of growing network models on flat and curved spaces. These models evolve by preferential attachment weighted by a function of the distance between nodes. The degree distribution of these models is similar to that of the fitness model of Bianconi and Barabási, with a fitness distribution dependent on the metric and the density of nodes. We show that ...
متن کاملSublinear but Never Superlinear Preferential Attachment by Local Network Growth
We investigate a class of network growth rules that are based on a redirection algorithm wherein new nodes are added to a network by linking to a randomly chosen target node with some probability 1− r or linking to the parent node of the target node with probability r. For fixed 0 < r < 1, the redirection algorithm is equivalent to linear preferential attachment. We show that when r is a decayi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.67.056104